How Fitch-Margoliash Algorithm can Benefit from Multi Dimensional Scaling

نویسندگان

  • Sylvain Lespinats
  • Delphine Grando
  • Eric Maréchal
  • Mohamed-Ali Hakimi
  • Olivier Tenaillon
  • Olivier Bastien
چکیده

Whatever the phylogenetic method, genetic sequences are often described as strings of characters, thus molecular sequences can be viewed as elements of a multi-dimensional space. As a consequence, studying motion in this space (ie, the evolutionary process) must deal with the amazing features of high-dimensional spaces like concentration of measured phenomenon.TO STUDY HOW THESE FEATURES MIGHT INFLUENCE PHYLOGENY RECONSTRUCTIONS, WE EXAMINED A PARTICULAR POPULAR METHOD: the Fitch-Margoliash algorithm, which belongs to the Least Squares methods. We show that the Least Squares methods are closely related to Multi Dimensional Scaling. Indeed, criteria for Fitch-Margoliash and Sammon's mapping are somewhat similar. However, the prolific research in Multi Dimensional Scaling has definitely allowed outclassing Sammon's mapping.Least Square methods for tree reconstruction can now take advantage of these improvements. However, "false neighborhood" and "tears" are the two main risks in dimensionality reduction field: "false neighborhood" corresponds to a widely separated data in the original space that are found close in representation space, and neighbor data that are displayed in remote positions constitute a "tear". To address this problem, we took advantage of the concepts of "continuity" and "trustworthiness" in the tree reconstruction field, which limit the risk of "false neighborhood" and "tears". We also point out the concentration of measured phenomenon as a source of error and introduce here new criteria to build phylogenies with improved preservation of distances and robustness.The authors and the Evolutionary Bioinformatics Journal dedicate this article to the memory of Professor W.M. Fitch (1929-2011).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates.

Using simulated data, we compared five methods of phylogenetic tree estimation: parsimony, compatibility, maximum likelihood, Fitch-Margoliash, and neighbor joining. For each combination of substitution rates and sequence length, 100 data sets were generated for each of 50 trees, for a total of 5,000 replications per condition. Accuracy was measured by two measures of the distance between the t...

متن کامل

Artificial Life 13

Phylogenetic trees are constructed frequently in biological research to provide an understanding of the evolutionary history of the organisms being studied. Often, the actual phylogenetic tree is unknown and the phylogenetic tree constructed is an estimate. There are many methods of phylogenetic tree construction which fall into two main categories: distance-based methods and character-based me...

متن کامل

PTC: An Interactive Tool for Phylogenetic Tree Construction

A phylogenetic tree represents the evolutionary history of a group of organisms. In this work, we introduce a novel interactive tool for constructing phylogenetic trees, Phylogenetic Tree Construction package. The package supports four well-known algorithms, Unweighted Pair Group Method using Arithmetic average, Neighbor Joining, Fitch Margoliash, and Maximum Parsimony.

متن کامل

Using Trajectory Mapping to Analyze Musical Intervals

Cognitive scientists have often pondered the question of perceptual spaces, that is, the question of how a certain gamut of familiar stimuli might be organized in the mind. We present Trajectory Mapping as an alternative clustering method to the traditional algorithm of Multi-Dimensional Scaling. We suggest that given data about the relationships among stimuli, Multi-Dimensional Scaling provide...

متن کامل

SoRT2: a tool for sorting genomes and reconstructing phylogenetic trees by reversals, generalized transpositions and translocations

SoRT(2) is a web server that allows the user to perform genome rearrangement analysis involving reversals, generalized transpositions and translocations (including fusions and fissions), and infer phylogenetic trees of genomes being considered based on their pairwise genome rearrangement distances. It takes as input two or more linear/circular multi-chromosomal gene (or synteny block) orders in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2011